Next | Prev | Up | Top | Contents | Index
Using Priorities and Scheduling Queues
The default IRIX scheduling algorithm is designed for a conventional time-sharing system, in which the best results are obtained by favoring I/O-bound processes and discouraging CPU-bound processes. However IRIX in a multiprocessor system supports a variety of scheduling disciplines that are optimized for parallel processes. You can take advantage of these in different ways to suit the needs of different programs.
Note: You can use the methods discussed here to make a real-time program more predictable. However, to reliably achieve a high frame rate, you should plan to use the REACT/Pro Frame Scheduler described in Chapter 7.
- Scheduling Concepts
-
- Setting a Nondegrading Batch Priority
-
- Setting a Nondegrading Real-Time Priority
-
- Understanding Affinity Scheduling
-
- Using Gang Scheduling
-
- Using Deadline Scheduling
-
- Changing the Time Slice Duration
-
Next | Prev | Up | Top | Contents | Index